We investigated not only the effects of schema-based instruction (SBI) on the mathematical outcomes of seventh-grade students with mathematical learning disabilities (MLD), but also extended prior work to analyze students’ written explanations on open-ended items involving ratio and proportion situations—ratio, proportion, and percent of change problems— to understand the ability to reason about proportions and identify misconceptions. The sample of 338 students with MLD [scored below the 25th percentile on a proportional problem solving (PPS) pretest] was taken from Jitendra, Harwell, Im, et al. (2019), which randomly assigned classrooms to either the SBI or control condition. Students with MLD in SBI classrooms outperformed their counterparts in control classrooms on proportional problem solving and general mathematics problem solving. Similar results, favoring the SBI condition, were found on the open-ended items; however, overall mean scores across pretest, posttest, and delayed posttest were low. Findings provide evidence for the limited understanding of fractional representations of ratios and highlight students’ persistent use of numerical and additive reasoning in explaining their low performance on the open-ended items. 相似文献
Many multiple attribute decision analysis problems include both quantitative and qualitative attributes with various kinds of uncertainties such as ignorance, fuzziness, interval data, and interval belief degrees. An evidential reasoning (ER) approach developed in the 1990s and in recent years can be used to model these problems. In this paper, the ER approach is extended to group consensus (GC) situations for multiple attributive group decision analysis problems. In order to construct and check the GC, a compatibility measure between two belief structures is developed first. Considering two experts’ utilities, the compatibility between their assessments is naturally constructed using the compatibility measure. Based on the compatibility between two experts’ assessments, the GC at a specific level that may be the attribute level, the alternative level, or the global level, can be constructed and reached after the group analysis and discussion within specified times. Under the condition of GC, we conduct a study on the forming of group assessments for alternatives, the achievement of the aggregated utilities of assessment grades, and the properties and procedure of the extended ER approach. An engineering project management software selection problem is solved by the extended ER approach to demonstrate its detailed implementation process, and its validity and applicability. 相似文献
Pupils’ difficulties in solving word problems continue to attract attention: while researchers highlight the importance of relational reasoning and modelling, school curricula typically use short word problems to develop pupils’ knowledge of arithmetic operations and calculation strategies. The Relational Paradigm attributes the leading role in mathematics learning to the development of relational thinking. Using this perspective, we implemented a new approach to teaching additive word problem-solving in primary school, encouraging relational thinking and modelling. We compared the overall results of additive word problems solved by Grade 2 elementary pupils in the experimental group (N?=?216) and in the control group (N?=?196). Our data show: (a) on average, the experimental group performed significantly better in problem-solving than the control group; and (b) in the control group, there was a considerable lack of success in solving problems that require relational thinking—there was no such effect in the experimental group. 相似文献
Models with intractable likelihood functions arise in areas including network analysis and spatial statistics, especially those involving Gibbs random fields. Posterior parameter estimation in these settings is termed a doubly intractable problem because both the likelihood function and the posterior distribution are intractable. The comparison of Bayesian models is often based on the statistical evidence, the integral of the un-normalized posterior distribution over the model parameters which is rarely available in closed form. For doubly intractable models, estimating the evidence adds another layer of difficulty. Consequently, the selection of the model that best describes an observed network among a collection of exponential random graph models for network analysis is a daunting task. Pseudolikelihoods offer a tractable approximation to the likelihood but should be treated with caution because they can lead to an unreasonable inference. This article specifies a method to adjust pseudolikelihoods to obtain a reasonable, yet tractable, approximation to the likelihood. This allows implementation of widely used computational methods for evidence estimation and pursuit of Bayesian model selection of exponential random graph models for the analysis of social networks. Empirical comparisons to existing methods show that our procedure yields similar evidence estimates, but at a lower computational cost. Supplementary material for this article is available online. 相似文献
In this note, we attempt to find all shortest single product axioms for commutative Moufang loops of exponent 3. These investigations were aided by the automated theorem-prover Prover9 and the model-generator Mace4. 相似文献
Constraint-based schedulers have been widely successful in tackling complex, disjunctive, and cumulative scheduling applications by combining tree search and constraint propagation. The constraint-propagation step is a fixpoint algorithm that applies pruning operators to tighten the release and due dates of activities using precedence or resource constraints. A variety of pruning operators for resource constraints have been proposed; they are based on edge finding or energetic reasoning and handle a single resource.
Complexity results in this area are only available for a single application of these pruning operators, which is problematic for at least two reasons. On the one hand, the operators are not idempotent, so a single application is rarely sufficient. On the other hand, the operators are not used in isolation but interact with each other. Existing results thus provide a very partial picture of the complexity of propagating resource constraints in constraint-based scheduling.
This paper aims at addressing these limitations. It studies the complexity of applying pruning operators for resource constraints to a fixpoint. In particular, it shows that: (1) the fixpoint of the edge finder for both release and due dates can be reached in strongly polynomial time for disjunctive scheduling; (2) the fixpoint can be reached in strongly polynomial time for updating the release dates or the due dates but not both for the cumulative scheduling; and (3) the fixpoint of “reasonable” energetic operators cannot be reached in strongly polynomial time, even for disjunctive scheduling and even when only the release dates or the due dates are considered. 相似文献
Two related aggregation operators called copulas and co-copulas are introduced and various properties are described. The relationship,
of these operators to t-norms and t-conorms is noted. Generalizations of these, respectively, called conjunctors and disjunctors, are introduced. We suggest
the use of disjunctor operators for modeling the multi-valued implication operator in fuzzy logic. We point out that the selection
of operators used in fuzzy logic, in addition to having appropriate pointwise properties, should be holistic, this requires
consideration of the nature of the resulting fuzzy set as a whole. Focusing on the protoform of fuzzy modus ponens and looking
at the information contained in the inferred fuzzy set we show that the use of co-copulas has some desirable properties. Taking
advantage of the fact that the weighted sum of co-copulas is a co-copula we consider the problem of constructing customized
implication operators. 相似文献